Comparison of Accelerating Techniques for Discontinuity Meshing

نویسندگان

  • Karel Nechvíle
  • Petr Tobola
  • Jirí Sochor
چکیده

Creating an appropriate mesh is one of demanding tasks of many global illumination algorithms. Discontinuity meshing proved to diminish artifacts caused by other meshing strategies. Since naive discontinuity meshing would produce a great amount of geometric computations, accelerating techniques are usually involved. In this paper, we present results obtained with help of k-discrete orientation polytopes (k-DOPs) and oriented bounding boxes (OBBs) and compare them to previously used accelerating schemes like voxels, BSP-trees and octrees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discontinuity Meshing for Complex Environments

Throughout this thesis, there is an underlying assumption that the quality of a computer graphics image is important. This thesis reports research into computer image synthesis for obtaining this quality. The introduction of discontinuity meshing into existing radiosity techniques has enabled images to be produced at levels of previously unobtainable quality. However, discontinuity meshing is a...

متن کامل

Dynamic Discontinuities for Radiosity

Discontinuity meshing has greatly enhanced the visual and numerical accuracy of radiosity solutions. However, its computational expense means that it cannot be used in dynamic interactive environments with current hardware. Techniques are proposed which allow the discontinuity information to be reused as the environment changes. These techniques complement existing dynamic radiosity methods whi...

متن کامل

Dynamic discontinuity meshing

Shadows are of great importance to computer graphics, especially for interactive animation, due to the visual cues which they provide. Most research in the field of dynamic shadowing has focussed on shadows from point light sources, since they are much easier to compute than those from area lights. This means that such shadows have sharp boundaries, and so resultant visualisations often appear ...

متن کامل

An Empirical Comparison of Progressive and Wavelet Radiosity

This paper presents a comparison of basic progressive and wavelet radiosity algorithms. Several variants of each algorithm were run on a set of scenes at several parameter settings, and results were examined in terms of their error, speed, and memory consumption. We did not compare more advanced variations such as clustering or discontinuity meshing. Our results show that progressive radiosity ...

متن کامل

Discontinuity Meshing and Hierarchical MultiWavelet Radiosity

In this paper we propose an extension to the work of Lischinski et al [1] on combining hierarchical radiosity method and discontinuity meshing. The extension proposed here supports higher order radiosity function at the es timation s tep itself. We have carried out this extension using M ultiWavelet basis function s. Unlike th e multi-wavelet radiosity work of Gortler et al [2] which uses reg u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003